Quasi-polynomial Time Approximation Algorithm for Low-Degree Minimum-Cost Steiner Trees
نویسندگان
چکیده
منابع مشابه
Two-level rectilinear Steiner trees
Given a set P of terminals in the plane and a partition of P into k subsets P1, . . . , Pk, a two-level rectilinear Steiner tree consists of a rectilinear Steiner tree Ti connecting the terminals in each set Pi (i = 1, . . . , k) and a top-level tree Ttop connecting the trees T1, . . . , Tk. The goal is to minimize the total length of all trees. This problem arises naturally in the design of lo...
متن کاملFor Peer Review Two - stage Robust Network Design with Exponential Scenarios
We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization problems, previously studied by Dhamdhere et al. [9], Golovin et al. [15], and Feige et al. [13], are two-stage planning problems in which the requirements are revealed after some decisions are taken in stage one. One has to th...
متن کاملApproximation Algorithms for the Restricted Steiner Tree Problem
We consider the problem of finding minimum cost Steiner trees with delay constraints. In this problem, referred to as the Restricted Steiner Tree problem, we are given a directed graph , in which each edge is associated with two parameters, namely delay and cost. We seek a minimum cost tree that connects a source with a set of terminals , such that the delay of the path in between and each term...
متن کاملDegree-bounded minimum spanning trees
* to be exact, times the weight of a minimum spanning tree (MST). In particular, we present an improved analysis of Chan’s degree-4 MST algorithm [4]. Previous results. Arora [1] and Mitchell [9] presented PTASs for TSP in Euclidean metric, for fixed dimensions. Unfortunately, neither algorithm extends to find degree-3 or degree-4 trees. Recently, Arora and Chang [3] have devised a quasi-polyno...
متن کاملCS261 - Optimization Paradigms Lecture Notes for 2009-2010 Academic Year
Given a connected graph G = (V, E) with non-negative edge costs, and a set of " special " nodes S ⊂ V , a subgraph of G is a Steiner tree, if it is a tree that spans (connects) all the (" special ") nodes in S. The Steiner Tree problem is to find a Steiner Tree of minimum weight (cost). Steiner Tree is an important NP-hard problem that is often encountered in practice. Examples include design o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003